A fast algorithm for calculating an expected outbreak size on dynamic contagion networks.

نویسندگان

  • Jessica Enright
  • Rowland R Kao
چکیده

Calculation of expected outbreak size of a simple contagion on a known contact network is a common and important epidemiological task, and is typically carried out by computationally intensive simulation. We describe an efficient exact method to calculate the expected outbreak size of a contagion on an outbreak-invariant network that is a directed and acyclic, allowing us to model all dynamically changing networks when contagion can only travel forward in time. We describe our algorithm and its use in pseudocode, as well as showing examples of its use on disease relevant, data-derived networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)

In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...

متن کامل

An Analysis of the COVID-19 Contagion Growth in European Countries

The COVID-19 pandemic has affected many people around the globe. Europe, as one of the most seriously affected continents, has been struggling with the novel coronavirus for several months. Obviously, outbreak response management plays a critical role in the impact of the disease. Therefore, in this paper, Malmquist Productivity Index is used to evaluate the performance of the most severely aff...

متن کامل

An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...

متن کامل

Assessment of ATC Using Voltage and Transient Stability, Simultaneously

Methods for calculating Available Transfer Capability (ATC) of the transmission systems may be grouped under Static and Dynamic methods. This paper presents a fast dynamic method for ATC calculations, which considers both Transient Stability Limits and Voltage Stability Limits as terminating criteria. A variation of Energy Function Method is used to determine the transient stability limit and t...

متن کامل

Assessment of ATC Using Voltage and Transient Stability, Simultaneously

Methods for calculating Available Transfer Capability (ATC) of the transmission systems may be grouped under Static and Dynamic methods. This paper presents a fast dynamic method for ATC calculations, which considers both Transient Stability Limits and Voltage Stability Limits as terminating criteria. A variation of Energy Function Method is used to determine the transient stability limit and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Epidemics

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2016